{"id":3021,"date":"2025-06-06T15:01:24","date_gmt":"2025-06-06T15:01:24","guid":{"rendered":"https:\/\/diznr.com\/?p=3021"},"modified":"2025-06-06T15:01:24","modified_gmt":"2025-06-06T15:01:24","slug":"day-03part-11-discrete-mathematics-example-on-lattice-how-to-find-a-hasse-diagram-is-lattice-not-or","status":"publish","type":"post","link":"https:\/\/www.reilsolar.com\/pdf\/day-03part-11-discrete-mathematics-example-on-lattice-how-to-find-a-hasse-diagram-is-lattice-not-or\/","title":{"rendered":"Day 03Part 11-Discrete Mathematics-Example on lattice How to find a hasse diagram is lattice or not"},"content":{"rendered":"<p>Day 03Part 11-Discrete Mathematics-Example on lattice How to find a hasse diagram is lattice or not<\/p>\n<p>[fvplayer id=&#8221;220&#8243;]<\/p>\n<h3 data-start=\"0\" data-end=\"52\"><strong data-start=\"4\" data-end=\"50\">\u00a0Day 03 | Part 11 \u2013 Discrete Mathematics<\/strong><\/h3>\n<h3 data-start=\"53\" data-end=\"131\"><strong data-start=\"57\" data-end=\"129\">\u00a0Example on Lattice: How to Check if a Hasse Diagram is a Lattice?<\/strong><\/h3>\n<h3 data-start=\"138\" data-end=\"175\"><strong data-start=\"141\" data-end=\"173\">\u00a0What is a Hasse Diagram?<\/strong><\/h3>\n<p data-start=\"176\" data-end=\"323\">A <strong data-start=\"178\" data-end=\"195\">Hasse diagram<\/strong> is a graphical representation of a <strong data-start=\"231\" data-end=\"264\">partially ordered set (poset)<\/strong>. It helps in visualizing relationships between elements.<\/p>\n<p data-start=\"325\" data-end=\"367\"><strong data-start=\"327\" data-end=\"365\">Rules for drawing a Hasse diagram:<\/strong><\/p>\n<ul data-start=\"368\" data-end=\"516\">\n<li data-start=\"368\" data-end=\"409\">Arrange elements in increasing order.<\/li>\n<li data-start=\"410\" data-end=\"466\">Draw <strong data-start=\"417\" data-end=\"426\">edges<\/strong> to connect directly related elements.<\/li>\n<li data-start=\"467\" data-end=\"516\"><strong data-start=\"469\" data-end=\"479\">Do not<\/strong> draw edges for indirect relations.<\/li>\n<\/ul>\n<h3 data-start=\"523\" data-end=\"581\"><strong data-start=\"526\" data-end=\"579\">\u00a0How to Check if a Hasse Diagram is a Lattice?<\/strong><\/h3>\n<p data-start=\"582\" data-end=\"643\">A poset is a <strong data-start=\"595\" data-end=\"606\">Lattice<\/strong> if <strong data-start=\"610\" data-end=\"640\">every pair of elements has<\/strong>:<\/p>\n<ul data-start=\"644\" data-end=\"736\">\n<li data-start=\"644\" data-end=\"688\">A <strong data-start=\"648\" data-end=\"686\">Least Upper Bound (LUB) \u2192 Join (\u2228)<\/strong><\/li>\n<li data-start=\"689\" data-end=\"736\">A <strong data-start=\"693\" data-end=\"734\">Greatest Lower Bound (GLB) \u2192 Meet (\u2227)<\/strong><\/li>\n<\/ul>\n<p data-start=\"738\" data-end=\"862\"><strong data-start=\"740\" data-end=\"759\">Steps to Check:<\/strong><br data-start=\"759\" data-end=\"762\" \/><strong data-start=\"766\" data-end=\"792\">Draw the Hasse Diagram<\/strong> of the given poset.<br data-start=\"812\" data-end=\"815\" \/><strong data-start=\"819\" data-end=\"844\">Pick any two elements<\/strong> and find their:<\/p>\n<ul data-start=\"866\" data-end=\"1090\">\n<li data-start=\"866\" data-end=\"932\"><strong data-start=\"868\" data-end=\"884\">LUB (Join \u2228)<\/strong> \u2192 The <strong data-start=\"891\" data-end=\"903\">smallest<\/strong> element greater than both.<\/li>\n<li data-start=\"936\" data-end=\"1090\"><strong data-start=\"938\" data-end=\"954\">GLB (Meet \u2227)<\/strong> \u2192 The <strong data-start=\"961\" data-end=\"972\">largest<\/strong> element smaller than both.<br data-start=\"999\" data-end=\"1002\" \/><strong data-start=\"1006\" data-end=\"1029\">Check for all pairs<\/strong> \u2013 If every pair has both Join &amp; Meet, it is a <strong data-start=\"1076\" data-end=\"1087\">Lattice<\/strong>.<\/li>\n<\/ul>\n<h3 data-start=\"1097\" data-end=\"1163\"><strong data-start=\"1100\" data-end=\"1161\">\u00a0Example: Check if the Following Poset Forms a Lattice<\/strong><\/h3>\n<p data-start=\"1165\" data-end=\"1248\">Consider the set <strong data-start=\"1182\" data-end=\"1202\">S = {1, 2, 3, 6}<\/strong> under divisibility.<br data-start=\"1222\" data-end=\"1225\" \/>The Hasse diagram is:<\/p>\n<div class=\"contain-inline-size rounded-md border-[0.5px] border-token-border-medium relative bg-token-sidebar-surface-primary\">\n<div class=\"overflow-y-auto p-4\" dir=\"ltr\"><code class=\"!whitespace-pre\"><span class=\"hljs-code\">     6<br \/>\n\/  \\<br \/>\n2    3<br \/>\n\\  \/<br \/>\n1<br \/>\n<\/span><\/code><\/div>\n<\/div>\n<p data-start=\"1301\" data-end=\"1338\"><strong data-start=\"1304\" data-end=\"1336\">Check Join (\u2228) and Meet (\u2227):<\/strong><\/p>\n<ul data-start=\"1339\" data-end=\"1533\">\n<li data-start=\"1339\" data-end=\"1436\">\n<p data-start=\"1341\" data-end=\"1356\"><strong data-start=\"1341\" data-end=\"1354\">Join (\u2228):<\/strong><\/p>\n<ul data-start=\"1359\" data-end=\"1436\">\n<li data-start=\"1359\" data-end=\"1396\">2 \u2228 3 = <strong data-start=\"1369\" data-end=\"1374\">6<\/strong> (smallest multiple)<\/li>\n<li data-start=\"1399\" data-end=\"1416\">1 \u2228 2 = <strong data-start=\"1409\" data-end=\"1414\">2<\/strong><\/li>\n<li data-start=\"1419\" data-end=\"1436\">1 \u2228 3 = <strong data-start=\"1429\" data-end=\"1434\">3<\/strong><\/li>\n<\/ul>\n<\/li>\n<li data-start=\"1438\" data-end=\"1533\">\n<p data-start=\"1440\" data-end=\"1455\"><strong data-start=\"1440\" data-end=\"1453\">Meet (\u2227):<\/strong><\/p>\n<ul data-start=\"1458\" data-end=\"1533\">\n<li data-start=\"1458\" data-end=\"1493\">2 \u2227 3 = <strong data-start=\"1468\" data-end=\"1473\">1<\/strong> (largest divisor)<\/li>\n<li data-start=\"1496\" data-end=\"1513\">2 \u2227 6 = <strong data-start=\"1506\" data-end=\"1511\">2<\/strong><\/li>\n<li data-start=\"1516\" data-end=\"1533\">3 \u2227 6 = <strong data-start=\"1526\" data-end=\"1531\">3<\/strong><\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p data-start=\"1535\" data-end=\"1609\"><strong data-start=\"1537\" data-end=\"1552\">Conclusion:<\/strong> Every pair has a Join &amp; Meet \u2192 <strong data-start=\"1584\" data-end=\"1604\">It is a Lattice!<\/strong><\/p>\n<h3 data-start=\"1616\" data-end=\"1667\"><strong data-start=\"1619\" data-end=\"1665\">\u00a0Example: A Poset That is NOT a Lattice<\/strong><\/h3>\n<p data-start=\"1669\" data-end=\"1738\">Consider the set <strong data-start=\"1686\" data-end=\"1702\">{a, b, c, d}<\/strong> with the following Hasse diagram:<\/p>\n<div class=\"contain-inline-size rounded-md border-[0.5px] border-token-border-medium relative bg-token-sidebar-surface-primary\">\n<div class=\"overflow-y-auto p-4\" dir=\"ltr\"><code class=\"!whitespace-pre\">     <span class=\"hljs-selector-tag\">a<\/span><br \/>\n\/ \\<br \/>\n<span class=\"hljs-selector-tag\">b<\/span>   c<br \/>\n\\ \/<br \/>\nd<br \/>\n<\/code><\/div>\n<\/div>\n<p data-start=\"1788\" data-end=\"1825\"><strong data-start=\"1791\" data-end=\"1823\">Check Join (\u2228) and Meet (\u2227):<\/strong><\/p>\n<ul data-start=\"1826\" data-end=\"1939\">\n<li data-start=\"1826\" data-end=\"1896\"><strong data-start=\"1828\" data-end=\"1852\">Join (\u2228) of b and c?<\/strong>\u00a0 (No single smallest element above both)<\/li>\n<li data-start=\"1897\" data-end=\"1939\"><strong data-start=\"1899\" data-end=\"1923\">Meet (\u2227) of a and d?<\/strong>\u00a0 (Exists, d)<\/li>\n<\/ul>\n<p data-start=\"1941\" data-end=\"2027\">\u00a0Since <strong data-start=\"1950\" data-end=\"1961\">b and c<\/strong> do not have a unique <strong data-start=\"1983\" data-end=\"1997\">LUB (Join)<\/strong>, this is <strong data-start=\"2007\" data-end=\"2025\">NOT a Lattice!<\/strong><\/p>\n<h3 data-start=\"2034\" data-end=\"2060\"><strong data-start=\"2037\" data-end=\"2058\">\u00a0Key Takeaways<\/strong><\/h3>\n<p data-start=\"2061\" data-end=\"2274\"><strong data-start=\"2063\" data-end=\"2141\">A poset is a Lattice if every two elements have a Join (\u2228) and a Meet (\u2227).<\/strong><br data-start=\"2141\" data-end=\"2144\" \/><strong data-start=\"2146\" data-end=\"2204\">Use Hasse diagrams to check Join &amp; Meet for all pairs.<\/strong><br data-start=\"2204\" data-end=\"2207\" \/><strong data-start=\"2209\" data-end=\"2272\">If any pair lacks Join or Meet, the poset is NOT a Lattice.<\/strong><\/p>\n<p data-start=\"2276\" data-end=\"2346\" data-is-last-node=\"\" data-is-only-node=\"\">Would you like <strong data-start=\"2291\" data-end=\"2340\">more examples or step-by-step solved problems<\/strong>?<\/p>\n<h3 data-start=\"2276\" data-end=\"2346\"><a href=\"https:\/\/e-sarthi.lpcps.org.in\/uploads\/Notes\/2\/12\/198\/Unit%20III\/UNIT_III.pdf\" target=\"_blank\" rel=\"noopener\">Day 03Part 11-Discrete Mathematics-Example on lattice How to find a hasse diagram is lattice or not<\/a><\/h3>\n<p><strong>\u0921\u093f\u0938\u094d\u0915\u094d\u0930\u0940\u091f \u092e\u0948\u0925\u092e\u0947\u091f\u093f\u0915\u094d\u0938<\/strong> \u092e\u0947\u0902 <strong>\u0932\u0948\u091f\u093f\u0938 (Lattice)<\/strong> \u090f\u0915 \u0935\u093f\u0936\u0947\u0937 \u092a\u094d\u0930\u0915\u093e\u0930 \u0915\u093e <strong>\u0906\u0902\u0936\u093f\u0915 \u0915\u094d\u0930\u092e\u093f\u0924 \u0938\u092e\u0941\u091a\u094d\u091a\u092f (Poset)<\/strong> \u0939\u094b\u0924\u093e \u0939\u0948, \u091c\u093f\u0938\u092e\u0947\u0902 \u092a\u094d\u0930\u0924\u094d\u092f\u0947\u0915 \u092f\u0941\u0917\u094d\u092e (pair) \u0915\u0947 \u0932\u093f\u090f \u090f\u0915 \u0905\u0926\u094d\u0935\u093f\u0924\u0940\u092f <strong>Least Upper Bound (LUB)<\/strong> \u0914\u0930 <strong>Greatest Lower Bound (GLB)<\/strong> \u0939\u094b\u0924\u093e \u0939\u0948\u0964 <strong>Hasse Diagram<\/strong> \u0915\u093e \u0909\u092a\u092f\u094b\u0917 \u0915\u0930\u0915\u0947 \u092f\u0939 \u0928\u093f\u0930\u094d\u0927\u093e\u0930\u093f\u0924 \u0915\u093f\u092f\u093e \u091c\u093e \u0938\u0915\u0924\u093e \u0939\u0948 \u0915\u093f \u0915\u094b\u0908 Poset \u0932\u0948\u091f\u093f\u0938 \u0939\u0948 \u092f\u093e \u0928\u0939\u0940\u0902\u0964<\/p>\n<hr \/>\n<h2>\ud83d\udd0d Hasse Diagram \u0938\u0947 \u0932\u0948\u091f\u093f\u0938 \u0915\u0940 \u092a\u0939\u091a\u093e\u0928 \u0915\u0948\u0938\u0947 \u0915\u0930\u0947\u0902?<\/h2>\n<p>Hasse Diagram \u090f\u0915 \u0917\u094d\u0930\u093e\u092b\u093f\u0915\u0932 \u092a\u094d\u0930\u0924\u093f\u0928\u093f\u0927\u093f\u0924\u094d\u0935 \u0939\u0948 \u091c\u094b Poset \u0915\u0947 \u0924\u0924\u094d\u0935\u094b\u0902 \u0914\u0930 \u0909\u0928\u0915\u0947 \u0906\u0902\u0936\u093f\u0915 \u0915\u094d\u0930\u092e \u0915\u094b \u0926\u0930\u094d\u0936\u093e\u0924\u093e \u0939\u0948\u0964 \u0907\u0938\u092e\u0947\u0902 \u0924\u0924\u094d\u0935\u094b\u0902 \u0915\u094b \u092c\u093f\u0902\u0926\u0941\u0913\u0902 \u0915\u0947 \u0930\u0942\u092a \u092e\u0947\u0902 \u0914\u0930 \u0909\u0928\u0915\u0947 \u0906\u0926\u0947\u0936 \u0938\u0902\u092c\u0902\u0927\u094b\u0902 \u0915\u094b \u0930\u0947\u0916\u093e\u0913\u0902 \u0915\u0947 \u092e\u093e\u0927\u094d\u092f\u092e \u0938\u0947 \u0926\u0930\u094d\u0936\u093e\u092f\u093e \u091c\u093e\u0924\u093e \u0939\u0948\u0964 Hasse Diagram \u0915\u0940 \u0938\u0939\u093e\u092f\u0924\u093e \u0938\u0947 \u0939\u092e \u0928\u093f\u092e\u094d\u0928\u0932\u093f\u0916\u093f\u0924 \u091a\u0930\u0923\u094b\u0902 \u0915\u093e \u092a\u093e\u0932\u0928 \u0915\u0930\u0915\u0947 \u092f\u0939 \u0928\u093f\u0930\u094d\u0927\u093e\u0930\u093f\u0924 \u0915\u0930 \u0938\u0915\u0924\u0947 \u0939\u0948\u0902 \u0915\u093f \u0915\u094b\u0908 Poset \u0932\u0948\u091f\u093f\u0938 \u0939\u0948 \u092f\u093e \u0928\u0939\u0940\u0902:<\/p>\n<ol>\n<li><strong>\u0939\u0930 \u092f\u0941\u0917\u094d\u092e \u0915\u0947 \u0932\u093f\u090f LUB \u0914\u0930 GLB \u0915\u0940 \u091c\u093e\u0902\u091a \u0915\u0930\u0947\u0902:<\/strong>\n<ul>\n<li>Poset \u0915\u0947 \u092a\u094d\u0930\u0924\u094d\u092f\u0947\u0915 \u092f\u0941\u0917\u094d\u092e (a, b) \u0915\u0947 \u0932\u093f\u090f \u092f\u0939 \u091c\u093e\u0902\u091a\u0947\u0902 \u0915\u093f \u0915\u094d\u092f\u093e \u0909\u0928\u0915\u0947 \u092a\u093e\u0938 \u090f\u0915 \u0905\u0926\u094d\u0935\u093f\u0924\u0940\u092f <strong>Least Upper Bound (LUB)<\/strong> \u0914\u0930 <strong>Greatest Lower Bound (GLB)<\/strong> \u0939\u0948\u0964<\/li>\n<li>\u092f\u0926\u093f \u0915\u093f\u0938\u0940 \u092f\u0941\u0917\u094d\u092e \u0915\u0947 \u0932\u093f\u090f LUB \u092f\u093e GLB \u092e\u094c\u091c\u0942\u0926 \u0928\u0939\u0940\u0902 \u0939\u0948, \u092f\u093e \u0905\u0926\u094d\u0935\u093f\u0924\u0940\u092f \u0928\u0939\u0940\u0902 \u0939\u0948, \u0924\u094b \u0935\u0939 Poset \u0932\u0948\u091f\u093f\u0938 \u0928\u0939\u0940\u0902 \u0939\u0948\u0964<\/li>\n<\/ul>\n<\/li>\n<li><strong>Hasse Diagram \u092e\u0947\u0902 \u0924\u0924\u094d\u0935\u094b\u0902 \u0915\u0940 \u0924\u0941\u0932\u0928\u093e \u0915\u0930\u0947\u0902:<\/strong>\n<ul>\n<li>Hasse Diagram \u092e\u0947\u0902 \u0926\u0947\u0916\u0947\u0902 \u0915\u093f \u0915\u094d\u092f\u093e \u092a\u094d\u0930\u0924\u094d\u092f\u0947\u0915 \u092f\u0941\u0917\u094d\u092e \u0915\u0947 \u0932\u093f\u090f \u090f\u0915 \u0938\u093e\u092e\u093e\u0928\u094d\u092f \u090a\u092a\u0930\u0940 \u0914\u0930 \u0928\u093f\u091a\u0932\u093e \u0924\u0924\u094d\u0935 \u092e\u094c\u091c\u0942\u0926 \u0939\u0948\u0964<\/li>\n<li>\u092f\u0926\u093f \u0915\u093f\u0938\u0940 \u092f\u0941\u0917\u094d\u092e \u0915\u0947 \u0932\u093f\u090f \u0910\u0938\u093e \u0924\u0924\u094d\u0935 \u0928\u0939\u0940\u0902 \u0939\u0948, \u0924\u094b \u0935\u0939 Poset \u0932\u0948\u091f\u093f\u0938 \u0928\u0939\u0940\u0902 \u0939\u0948\u0964<\/li>\n<\/ul>\n<\/li>\n<li><strong>\u0909\u0926\u093e\u0939\u0930\u0923 \u0915\u0947 \u092e\u093e\u0927\u094d\u092f\u092e \u0938\u0947 \u0938\u092e\u091d\u0947\u0902:<\/strong>\n<ul>\n<li>\u0909\u0926\u093e\u0939\u0930\u0923 \u0915\u0947 \u0932\u093f\u090f, \u092f\u0926\u093f \u0939\u092e\u093e\u0930\u0947 \u092a\u093e\u0938 \u0938\u0902\u0916\u094d\u092f\u093e\u0913\u0902 \u0915\u093e \u0938\u092e\u0941\u091a\u094d\u091a\u092f {1, 2, 3, 6} \u0939\u0948 \u0914\u0930 \u0939\u092e &#8220;a divides b&#8221; (a, b \u0915\u094b \u0935\u093f\u092d\u093e\u091c\u093f\u0924 \u0915\u0930\u0924\u093e \u0939\u0948) \u0938\u0902\u092c\u0902\u0927 \u092a\u0930 \u0935\u093f\u091a\u093e\u0930 \u0915\u0930\u0924\u0947 \u0939\u0948\u0902, \u0924\u094b \u092f\u0939 \u090f\u0915 \u0932\u0948\u091f\u093f\u0938 \u092c\u0928\u093e\u0924\u093e \u0939\u0948 \u0915\u094d\u092f\u094b\u0902\u0915\u093f \u0939\u0930 \u092f\u0941\u0917\u094d\u092e \u0915\u0947 \u0932\u093f\u090f LUB \u0914\u0930 GLB \u092e\u094c\u091c\u0942\u0926 \u0939\u094b\u0924\u0947 \u0939\u0948\u0902\u0964<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n<hr \/>\n<h2>\ud83d\udcca Hasse Diagram \u0915\u0947 \u0909\u0926\u093e\u0939\u0930\u0923<\/h2>\n<p>\u0928\u0940\u091a\u0947 \u0926\u093f\u090f \u0917\u090f \u0935\u0940\u0921\u093f\u092f\u094b \u092e\u0947\u0902 Hasse Diagram \u0915\u0947 \u0935\u093f\u092d\u093f\u0928\u094d\u0928 \u0909\u0926\u093e\u0939\u0930\u0923\u094b\u0902 \u0915\u0947 \u092e\u093e\u0927\u094d\u092f\u092e \u0938\u0947 \u092f\u0939 \u0938\u092e\u091d\u093e\u092f\u093e \u0917\u092f\u093e \u0939\u0948 \u0915\u093f \u0915\u0948\u0938\u0947 \u092f\u0939 \u0928\u093f\u0930\u094d\u0927\u093e\u0930\u093f\u0924 \u0915\u093f\u092f\u093e \u091c\u093e\u090f \u0915\u093f \u0915\u094b\u0908 Poset \u0932\u0948\u091f\u093f\u0938 \u0939\u0948 \u092f\u093e \u0928\u0939\u0940\u0902:<\/p>\n<p>CHECK WHETHER 15 HASSE DIAGRAMS ARE LATTICES OR &#8230;<\/p>\n<hr \/>\n<p>\u092f\u0926\u093f \u0906\u092a \u0915\u093f\u0938\u0940 \u0935\u093f\u0936\u0947\u0937 Hasse Diagram \u092f\u093e Poset \u0915\u0947 \u0909\u0926\u093e\u0939\u0930\u0923 \u092a\u0930 \u091a\u0930\u094d\u091a\u093e \u0915\u0930\u0928\u093e \u091a\u093e\u0939\u0924\u0947 \u0939\u0948\u0902, \u0924\u094b \u0915\u0943\u092a\u092f\u093e \u0935\u093f\u0935\u0930\u0923 \u092a\u094d\u0930\u0926\u093e\u0928 \u0915\u0930\u0947\u0902, \u0924\u093e\u0915\u093f \u0939\u092e \u0909\u0938 \u092a\u0930 \u0935\u093f\u0938\u094d\u0924\u093e\u0930 \u0938\u0947 \u091a\u0930\u094d\u091a\u093e \u0915\u0930 \u0938\u0915\u0947\u0902\u0964<\/p>\n<h3><a href=\"https:\/\/igntu.ac.in\/eContent\/IGNTU-eContent-536640959349-BCA-2-Mr.SudeshKumar-DiscreteMathematics-Unit-4.pdf\" target=\"_blank\" rel=\"noopener\">Day 03Part 11-Discrete Mathematics-Example on lattice How to find a hasse diagram is lattice or not<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/www.lkouniv.ac.in\/site\/writereaddata\/siteContent\/202005031349267328Hasse%20Diagram%20for%20BCA%204TH%20SEM.pdf\" target=\"_blank\" rel=\"noopener\">Hasse Diagram\u00a0<\/a><\/h3>\n<h3 class=\"LC20lb MBeuO DKV0Md\"><a href=\"https:\/\/math.hawaii.edu\/~jb\/math618\/LTNotes.pdf\" target=\"_blank\" rel=\"noopener\">Notes on Lattice Theory<\/a><\/h3>\n","protected":false},"excerpt":{"rendered":"<p>Day 03Part 11-Discrete Mathematics-Example on lattice How to find a hasse diagram is lattice or not [fvplayer id=&#8221;220&#8243;] \u00a0Day 03 | Part 11 \u2013 Discrete Mathematics \u00a0Example on Lattice: How to Check if a Hasse Diagram is a Lattice? \u00a0What is a Hasse Diagram? A Hasse diagram is a graphical representation of a partially ordered [&hellip;]<\/p>\n","protected":false},"author":71,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[76],"tags":[],"class_list":["post-3021","post","type-post","status-publish","format-standard","hentry","category-discrete-mathematics"],"_links":{"self":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3021","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/users\/71"}],"replies":[{"embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/comments?post=3021"}],"version-history":[{"count":0,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/posts\/3021\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/media?parent=3021"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/categories?post=3021"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.reilsolar.com\/pdf\/wp-json\/wp\/v2\/tags?post=3021"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}